Chain automata

Encryption using cellular automata chain-rules

Chain rules are maximally chaotic CA rules that can be constructed at random to provide a huge number of encryption keys — where the the CA is run backwards to encrypt, forwards to decrypt. The methods are based on the reverse algorithm and the Z-parameter [5]. 1 The CA reverse algorithm and basins of attraction In the simplest cellular automata [4], each cell in a ring of cells updates its val...

Grammars and Automata to Optimize Chain

The critical problem of finding efficient implementations for recursive queries with bound arguments offers many open challenges of practical and theoretical import. In particular, we need methods that are effective for the general case, such as non-linear programs, as well as for specialized cases, such as left-recursive linear programs. In this paper, we propose a novel approach that solves t...

The Rabin Index and Chain automata , withapplications to automata and gamesSriram

In this paper we relate the Rabin Index of an !-language to the complexity of translation amongst automata, strategies for two-person regular games, and the complexity of controller-synthesis and veriication for real systems, via a new construction to transform Rabin automata to Chain automata. The Rabin Index is the minimum number of pairs required to realize the language as a deterministic Ra...

Finite Automata and Zero Temperature Quasicrystal Ising Chain

Efficient Detection of Complex Event Patterns Using Lazy Chain Automata

Complex Event Processing (CEP) is an emerging field with important applications in many areas. CEP systems collect events arriving from input data streams and use them to infer more complex events according to predefined patterns. The Non-deterministic Finite Automaton (NFA) is one of the most popular mechanisms on which such systems are based. During the event detection process, NFAs increment...